The Completion Time of Programs on Processors Subject to Failure and Repair

نویسندگان

  • Phillip F. Chimento
  • Kishor S. Trivedi
چکیده

The objective of this paper is to describe a technique for computing the distribution of the completion time of a program on a server subject to failure and repair. Several realistic aspects of the system are included in the model. The server behavior is modeled by a semi-Markov process in order to accommodate nonexponential repair-time distributions. More importantly, the effect on the job completion time of the work lost due to the occurrence of a server failure is modeled. We derive a closed-form expression for the Laplace-Stieltjes transform (LST) of the time to completion distribution of programs on such systems. We then describe an effective numerical procedure for computing the completion time distribution. We show how these results apply to the analysis of different computer system structures and organizations of fault-tolerant systems. Finally, we use numerical solution methods to find the distribution of time to completion on several systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ANALYSIS OF DISCRETE-TIME MACHINE REPAIR PROBLEM WITH TWO REMOVABLE SERVERS UNDER TRIADIC POLICY

This paper analyzes a controllable discrete-time machine repair problem withL operating machines and two repairmen. The number of working servers can be adjusteddepending on the number of failed machines in the system one at a time at machine's failure orat service completion epochs. Analytical closed-form solutions of the stationary probabilities ofthe number of failed machines in the system a...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

Using Data Mining and Three Decision Tree Algorithms to Optimize the Repair and Maintenance Process

The purpose of this research is to predict the failure of devices using a data mining tool. For this purpose, at the outset, an appropriate database consists of 392 records of ongoing failures in a pharmaceutical company in 1394, in the next step, by analyzing 9 characteristics and type of failure as a database class, analyzes have been used. In this regard, three decision tree algorithms have ...

متن کامل

Reliability Analysis of Redundant Repairable System with Degraded Failure

This investigation deals with the transient analysis of the machine repair system consisting of M-operating units operating under the care of single repairman. To improve the system reliability/availability, Y warm standby and S cold standby units are provided to replace the failed units. In case when all spares are being used, the failure of units occurs in degraded fashion. In such situation ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 42  شماره 

صفحات  -

تاریخ انتشار 1993